Survey-based Comparison of Chord Overlay Networks

نویسندگان

  • Alaa Arabiyat
  • Mohammad F. Ababneh
  • Luc Onana Alima
  • Ali Ghodsi
  • Miguel Castro
  • Peter Druschel
  • Anne-Marie Kermarrec
  • Antony Rowstron
  • H. Balakrishnan
  • F. Kaashoek
  • D. Karger
  • R. Morris
  • I. Stoica
  • Eng Keong Lua
  • Jon Crowcroft
  • Feng Hong
  • Minglu Li
  • Min-you Wu
  • Jiadi Yu
  • Keith Needels
  • Minseok Kwon
  • Jian-Ming Chang
  • Yi-Hsuan Lin
  • Isaac Woungang
  • Han-Chieh Chao
  • Li CHEN
  • Zilin SONG
  • Shiming ZHENG
  • Wenjie SUN
  • Zhanfeng WANG
چکیده

Chord is a structured peer-to-peer (P2P) overlay network in which participating peers share resources as equals. To find a specific data item within the network, Chord system provide a lookup mechanism that matches a given key to a network node responsible for the value associated with that key. Chord is recently proposed to become one of the new approaches for building large-scale Internet applications. This paper aims to survey the Chord network, study its main characteristics, and compare its original performance with the performance of the enhancements being deployed over the original Chord.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Evaluation of Scalable Application-Level Multicast Built Using Peer-To-Peer Overlays

Structured peer-to-peer overlay networks such as CAN, Chord, Pastry, and Tapestry can be used to implement Internet-scale application-level multicast. There are two general approaches to accomplishing this: tree building and flooding. This paper evaluates these two approaches using two different types of structured overlay: 1) overlays which use a form of generalized hypercube routing, e.g., Ch...

متن کامل

An Evaluation of Scalable Application-Level Multicast Built Using Peer-To-Peer Overlay Networks

Peer-to-peer overlay networks such as CAN, Chord, Pastry, and Tapestry can be used to implement Internet-scale application-level multicast. There are two general approaches to accomplishing this: tree building (used by Bayeux and Scribe); and flooding (used by CAN Multicast). This paper presents of an evaluation of these two approaches using CAN and Pastry as the underlying overlay networks. We...

متن کامل

Effective Load Balancing in Overlay Chord & P Grid Networks

In structured chord & P Grid systems finding the successor nodes, Load balancing and dynamic routing are the challenging issues because nodes are heterogeneous and dynamically nodes may join the network or old node may release from network. We present a general framework, HiGLOB, for global load balancing in structured Chord systems. Current load balancing, finding optimized node and dynamic ro...

متن کامل

Estimating the size of a Chord ring

The Chord system is a decentralized peer-to-peer mechanism designed to store and search key/value pairs. The peers in a Chord overlay network are represented on a circle, whereas each peer has to maintain log 2 (n) neighbors to guarantee a stable overlay structure in the presence of high churn rates. A single peer, however, does not know the current size n of the Chord ring. Choosing a constant...

متن کامل

Taxonomy of Structured P2P Overlay Networks Security Attacks

The survey and classification of the different security attacks in structured peer-to-peer (P2P) overlay networks can be useful to computer system designers, programmers, administrators, and users. In this paper, we attempt to provide a taxonomy of structured P2P overlay networks security attacks. We have specially focused on the way these attacks can arise at each level of the network. Moreove...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013